منابع مشابه
Merge Times and Hitting Times of Time-inhomogeneous Markov Chains
The purpose of this thesis is to study the long term behavior of time-inhomogeneous Markov chains. We analyze under what conditions they converge, in what sense they converge and what the rate of convergence should be. A Markov chain is a random process with the memoryless property: the next state only depends on the current state, and not on the sequence of events that preceded it. Time-inhomo...
متن کاملWaiting time paradox applied to transient times
When working with chaotic systems, the average length of a transient phase before a particular event occurs is often required. Examples of this include the transient phase before a control mechanism can be activated @1,2# or the length of a chaotic transient after a crisis has occurred @3#. In both cases, the transient occurs before iterates fall into a small region. For controlling chaos, this...
متن کاملContinuous-time random walks at all times.
Continuous-time random walks (CTRW) play an important role in understanding of a wide range of phenomena. However, most theoretical studies of these models concentrate only on dynamics at long times. We present a new theoretical approach, based on generalized master equations picture, which allowed us to obtain explicit expressions for Laplace transforms for all dynamic quantities for different...
متن کاملNote S 4 : Glyph Times Time frames
The glyphs, which are presented in full in Figure S13, not only made predictions of a lunar or solar eclipse in a particular month but also what time of day that eclipse might occur. Eclipse times in the glyphs are given as integers on a 12-hour scale using the ancient Greek number system with the alphabet standing for numbers and an additional symbol ς for 6. The times in the glyphs are modifi...
متن کاملCharacteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
We give an account of the basic determinants of the courses of computation of an Infinite Time Turing machine (ITTM), a model of computation which allows for transfinitely many steps of computation. One such basic theorem relates the ordinal codes capable of being output on halting computations to those capable of being produced eventually by some non-terminating computation. This socaled “λ-ζ-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cohesive Journal of Microbiology & Infectious Disease
سال: 2018
ISSN: 2578-0190
DOI: 10.31031/cjmi.2018.01.000509